A Motion Constraint Dynamic Path Planning Algorithm for Multi-Agent Simulations
نویسندگان
چکیده
In this paper, we present a novel motion-orientated path planning algorithm fo r real-time navigation of mobile agents. The algorithm works well in dynamical and un-configured environments, and is able to produce a collision-free, time -optimal motion trajectory in order to find a navigation path. In addition to the motion constraint path planning, our approach can deal with the unknown obstacle-space terrains to moving agents. It therefore solves the drawbacks of traditional obstacle-space configuration methods. Multi-agent behaviour has been explored based on the algorithm. In the simulation a simple physically-based aircraft model has been developed, which is addressing the manoeuvring capabilities of the moving agents, while the moving agents' accelerations and velocities are always continuous and bounded. The generated motion path is constituted smoothly and has continuous curvature on the whole state space of the motion, thus satisfying the major requirement for the implementation of such strategies in real-time animation or in simulation applications in VR environments.
منابع مشابه
Optimal Trajectory Planning of a Box Transporter Mobile Robot
This paper aims to discuss the requirements of safe and smooth trajectory planning of transporter mobile robots to perform non-prehensile object manipulation task. In non-prehensile approach, the robot and the object must keep their grasp-less contact during manipulation task. To this end, dynamic grasp concept is employed for a box manipulation task and corresponding conditions are obtained an...
متن کاملMulti-agent Animation Techniques for Traffic Simulation in Urban Environment
This paper presents a traffic simulation system based on multi-agent animation method. The behaviour model of individual virtual agent defines the driving characteristics of the vehicle agent and cell-based configurations allow real-time dynamic path planning and efficient traffic flow simulations. By incorporating the advantages of discrete cellular automation algorithms and the continuous mod...
متن کاملTrajectory Planning Using High Order Polynomials under Acceleration Constraint
The trajectory planning, which is known as a movement from starting to end point by satisfying the constraints along the path is an essential part of robot motion planning. A common way to create trajectories is to deal with polynomials which have independent coefficients. This paper presents a trajectory formulation as well as a procedure to arrange the suitable trajectories for applications. ...
متن کاملCollaborator: A Nonholonomic Multiagent Team for Tasks in a Dynamic Environment
In our previous work, we proposed a potential field based hybrid path planning scheme for robot navigation that achieves complete coverage in various tasks. This paper is an extension of this work producing a multi-agent framework, Collaborator, that integrates a high-level negotiation-based task allocation protocol with a low-level path planning method taking into consideration several real-wo...
متن کاملInformation-rich Path Planning with General Constraints using Rapidly-exploring Random Trees
This paper introduces the Information-rich Rapidly-exploring Random Tree (IRRT), an extension of the RRT algorithm that embeds information collection as predicted using Fisher Information Matrices. The primary contribution of this algorithm is target-based information maximization in general (possibly heavily constrained) environments, with complex vehicle dynamic constraints and sensor limitat...
متن کامل